On Solving Three Classes of Nonlinear Programming Problems via Simple Differentiable Penalty Functions
نویسنده
چکیده
We consider the following classes of nonlinear programming problems: the minimization of smooth functions subject to general constraints and simple bounds on the variables; the noniinear l~problem; and the minimax problem. Numerically reliable methods for solving problems in each of these classes, based upon exploiting the structure of the problem in constructing simple differentiable penalty functions, are presented.
منابع مشابه
Decrease of the Penalty Parameter in Differentiable Penalty Function Methods
We propose a simple modification to the differentiable penalty methods for solving nonlinear programming problems. This modification decreases the penalty parameter and the ill-conditioning of the penalty method and leads to a faster convergence to the optimal solution. We extend the modification to the augmented Lagrangian method and report some numerical results on several nonlinear programmi...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملAn Evolutionary Algorithm for Zero-one Nonlinear Optimization Problems Based on an Objective Penalty Function Method
In many evolutionary algorithms, as fitness functions, penalty functions play an important role. In order to solve zero-one nonlinear optimization problems, a new objective penalty function is defined in this paper and some of its properties for solving integer nonlinear optimization problems are given. Based on the objective penalty function, an algorithm with global convergence for integer no...
متن کاملExact Augmented Lagrangian Functions for Nonlinear Semidefinite Programming∗
In this paper, we study augmented Lagrangian functions for nonlinear semidefinite programming (NSDP) problems with exactness properties. The term exact is used in the sense that the penalty parameter can be taken appropriately, so a single minimization of the augmented Lagrangian recovers a solution of the original problem. This leads to reformulations of NSDP problems into unconstrained nonlin...
متن کاملSl1QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems
In this paper, we propose an algorithm based on Fletcher’s Sl1QP method and the trust region technique for solving Nonlinear Second-Order Cone Programming (NSOCP) problems. The Sl1QP method was originally developed for nonlinear optimization problems with inequality constraints. It converts a constrained optimization problem into an unconstrained problem by using the l1 exact penalty function, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004